Verifying chemical reaction network implementations: A pathway decomposition approach
نویسندگان
چکیده
منابع مشابه
Verifying Chemical Reaction Network Implementations: A Pathway Decomposition Approach
The emerging fields of genetic engineering, synthetic biology, DNA computing, DNA nanotechnology, and molecular programming herald the birth of a new information technology that acquires information by directly sensing molecules within a chemical environment, stores information in molecules such as DNA, RNA, and proteins, processes that information by means of chemical and biochemical transform...
متن کاملVerifying Chemical Reaction Network Implementations: A Bisimulation Approach
Efforts in programming DNA and other biological molecules have recently focused on general schemes to physically implement arbitrary Chemical Reaction Networks. Errors in some of the proposed schemes have driven a desire for formal verification methods. We show that by interpreting each implementation species as a set of formal species, the concept of weak bisimulation can be adapted to CRNs in...
متن کاملVerifying Constant-Time Implementations
The constant-time programming discipline is an effective countermeasure against timing attacks, which can lead to complete breaks of otherwise secure systems. However, adhering to constant-time programming is hard on its own, and extremely hard under additional efficiency and legacy constraints. This makes automated verification of constant-time code an essential component for building secure s...
متن کاملVerifying Reference Counting Implementations
Reference counting is a widely-used resource management idiom which maintains a count of references to each resource by incrementing the count upon an acquisition, and decrementing upon a release; resources whose counts fall to zero may be recycled. We present an algorithm to verify the correctness of reference counting with minimal user interaction. Our algorithm performs compositional verific...
متن کاملVerifying Authentication Protocol Implementations
Formal methods for verifying authentication protocols tend to assume an idealised perfect form of encryption This approach has been spec tacularly successful in nding aws but when we aim for proofs of cor rectness then we need to consider this assumption more carefully and perhaps to weaken it to re ect properties of real cryptographic mech anisms This paper reviews the existing CSP approach to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2019
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2017.10.011